Collaborative Gaussian Processes for Preference Learning

نویسندگان

  • Neil Houlsby
  • José Miguel Hernández-Lobato
  • Ferenc Huszar
  • Zoubin Ghahramani
چکیده

We present a new model based on Gaussian processes (GPs) for learning pairwise preferences expressed by multiple users. Inference is simplified by using a preference kernel for GPs which allows us to combine supervised GP learning of user preferences with unsupervised dimensionality reduction for multi-user systems. The model not only exploits collaborative information from the shared structure in user behavior, but may also incorporate user features if they are available. Approximate inference is implemented using a combination of expectation propagation and variational Bayes. Finally, we present an efficient active learning strategy for querying preferences. The proposed technique performs favorably on real-world data against state-of-the-art multi-user preference learning algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning Community-Based Preferences via Dirichlet Process Mixtures of Gaussian Processes

Bayesian approaches to preference learning using Gaussian Processes (GPs) are attractive due to their ability to explicitly model uncertainty in users’ latent utility functions; unfortunately existing techniques have cubic time complexity in the number of users, which renders this approach intractable for collaborative preference learning over a large user base. Exploiting the observation that ...

متن کامل

Sparse Gaussian Processes for Learning Preferences

Preference learning has recently gained significant attention in the machine learning community. This is mainly due to its increasing applications in real-world problems such as recommender systems. In this paper, we investigate a Gaussian process framework for learning preferences that uses Expectation Propagation (EP) as its main inference method. This framework is capable of using the collab...

متن کامل

Scalable Collaborative Bayesian Preference Learning

Learning about users’ utilities from preference, discrete choice or implicit feedback data is of integral importance in e-commerce, targeted advertising and web search. Due to the sparsity and diffuse nature of data, Bayesian approaches hold much promise, yet most prior work does not scale up to realistic data sizes. We shed light on why inference for such settings is computationally difficult ...

متن کامل

Multi-task Preference learning with Gaussian Processes

We present an EM-algorithm for the problem of learning user preferences with Gaussian processes in the context of multi-task learning. We validate our approach on an audiological data set and show that predictive results for sound quality perception of normal hearing and hearingimpaired subjects, in the context of pairwise comparison experiments, can be improved using the hierarchical model.

متن کامل

Learning Preferences with Hidden Common Cause Relations

Gaussian processes have successfully been used to learn preferences among entities as they provide nonparametric Bayesian approaches for model selection and probabilistic inference. For many entities encountered in real-world applications, however, there are complex relations between them. In this paper, we present a preference model which incorporates information on relations among entities. S...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012